A Modified Levenberg-Marquardt (L-M) Algorithm for Traffic Equilibrium Problem with Nonadditive Route Costs
نویسندگان
چکیده
منابع مشابه
The Traffic Equilibrium Problem with Nonadditive Path Costs
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...
متن کاملA modified Levenberg–Marquardt algorithm for quasi-linear geostatistical inversing
The Quasi-Linear Geostatistical Approach is a method of inverse modeling to identify parameter fields, such as the hydraulic conductivity in heterogeneous aquifers, given observations of related quantities like hydraulic heads or arrival times of tracers. Derived in the Bayesian framework, it allows to rigorously quantify the uncertainty of the identified parameter field. Since inverse modeling...
متن کاملLevenberg Marquardt ( LM ) Algorithm 1 –
1 – Introduction Parameter estimation for function optimization is a well established problem in computing, as there are countless applications in practice. For this work, we will focus specifically in implementing a distributed and parallel implementation of the Levenberg Marquardt algorithm, which is a well established numerical solver for function approximation given a limited data set. Para...
متن کاملA Modified Levenberg-Marquardt Method for the Bidirectional Relay Channel
This paper presents an optimization approach for a system consisting of multiple bidirectional links over a two-way amplify-and-forward relay. It is desired to improve the fairness of the system. All user pairs exchange information over one relay station with multiple antennas. Due to the joint transmission to all users, the users are subject to mutual interference. A mitigation of the interfer...
متن کاملA self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia - Social and Behavioral Sciences
سال: 2014
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2014.07.208